منابع مشابه
The almost surely shrinking yolk
The yolk, defined by McKelvey as the smallest ball intersecting all median hyperplanes, is a key concept in the Euclidean spatial model of voting. Koehler conjectured that the yolk radius of a random sample from a uniform distribution on a square tends to zero. The following sharper and more general results are proved here: Let the population be a random sample from a probability measure μ on <...
متن کاملFast Almost-Surely Terminating Byzantine Agreement
We present a new asynchronous Byzantine agreement protocol with almost-sure termination, i.e. all correct processes terminate with probability one. In a system with n = 3t+1 processes, where t is the tolerated number of faulty ones, our protocol has linear expected running time, improving on the time complexity of the state-of-the-art protocol of Abraham, Dolev, and Halpern [1] by a factor of O...
متن کاملWhen Structures Are Almost Surely Connected
Let An denote the number of objects of some type of “size” n, and let Cn denote the number of these objects which are connected. It is often the case that there is a relation between a generating function of the Cn’s and a generating function of the An’s. Wright showed that if limn→∞Cn/An = 1, then the radius of convergence of these generating functions must be zero. In this paper we prove that...
متن کاملUniversal computation is 'almost surely' chaotic
Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard notions of a chaotic system is not readily applicable for them. Changing the state space of Turing Machines from integer to rational space, the condition for chao...
متن کاملProving Newtonian Arbiters Correct, almost surely
This paper presents the verification of safety and liveness for two arbiters modeled with differential equations. The first is a “toy” arbiter, whose model was chosen for its tractability; the second is Seitz’s nMOS arbiter, chosen as an example of a widely used and studied design. Because an arbiter cannot be guaranteed to respond correctly in any boundedamount of time, we verify liveness in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Social Sciences
سال: 2010
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2009.09.006